- labeling algorithm
- мат.алгоритм пометок (для задачи о максимальном потоке в сети)
English-Russian scientific dictionary. 2008.
labeling algorithm
Смотреть что такое "labeling algorithm" в других словарях:
Connected-component labeling — (alternatively connected component analysis, blob extraction, region labeling, blob discovery, or region extraction) is an algorithmic application of graph theory, where subsets of connected components are uniquely labeled based on a given… … Wikipedia
Connected Component Labeling — (alternatively connected component analysis) is an algorithmic application of graph theory, where subsets of connected components are uniquely labeled based on a given heuristic. Connected component labeling is not to be confused with… … Wikipedia
Cluster labeling — is closely related to the concept of text clustering. This process tries to select descriptive labels for the clusters obtained through a clustering algorithm such as Flat Clustering and Hierarchical Clustering. For example, a cluster of… … Wikipedia
Multiplication algorithm — A multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are in use. Efficient multiplication algorithms have existed since the advent of the decimal system.… … Wikipedia
CURE data clustering algorithm — CURE (Clustering Using REpresentatives) is an efficient data clustering algorithm for large databases that is more robust to outliers and identifies clusters having non spherical shapes and wide variances in size. Contents 1 Drawbacks of… … Wikipedia
Momel (algorithm) — Momel (Modelling melody) is an algorithm developed by Daniel Hirst[1] [2] and Robert Espesser at the CNRS Laboratoire Parole et Langage [3], Aix en Provence: [3] for the analysis and synthesis of intonation patterns. Cont … Wikipedia
2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… … Wikipedia
Automatic label placement — (sometimes called text placement or name placement) refers to the computer methods of placing labels automatically on a map or chart. This is related to the typographic design of such labels. Maps communicate spatial information to the reader,… … Wikipedia
List of algorithms — The following is a list of the algorithms described in Wikipedia. See also the list of data structures, list of algorithm general topics and list of terms relating to algorithms and data structures.If you intend to describe a new algorithm,… … Wikipedia
Constraint logic programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing … Wikipedia
Mathematics of Sudoku — The class of Sudoku puzzles consists of a partially completed row column grid of cells partitioned into N regions each of size N cells, to be filled in using a prescribed set of N distinct symbols (typically the numbers {1, ..., N}), so that each … Wikipedia
